Induction by Enumeration

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Induction by Enumeration

Induction by enumeration has a clear interpretation within the numerical paradigm of inductive discovery (i.e., the one pioneered by [Gold, 1967]). The concept is less easily interpreted within the first-order paradigm discussed by [Kelly, 1996, Martin & Osherson, 1998], in which the scientist’s data amount to the basic diagram of a structure. We formulate two kinds of enumerative induction tha...

متن کامل

Enumeration of trees by inversions

Mallows and Riordan “The Inversion Enumerator for Labeled Trees,” Bulletin of the American Mathematics Society, vol. 74 119681 pp. 92-94) first defined the inversion polynomial, JJ9) for trees with n vertices and found its generating function. In the present work, we define inversion polynomials for ordered, plane, and cyclic trees, and find their values at 9 = 0, t l . Our techniques involve t...

متن کامل

Enumeration of Enumeration Algorithms

In this paper, we enumerate enumeration problems and algorithms. Other useful catalogues for enumeration algorithms are provided by Komei Fukuda and Yasuko Matsui. This survey is under construction. If you know some results not in this survey or there is anything wrong, please let me know.

متن کامل

On the enumeration of sentences by compactness

Presented is a Julia meta-program that discovers compact theories from data if they exist. It writes candidate theories in Julia and then validates: tossing the bad theories and keeping the good theories. Compactness is measured by a metric: such as the number of space-time derivatives. The underlying algorithm is applicable to a wide variety of combinatorics problems and compactness serves to ...

متن کامل

Quantifier Elimination by Lazy Model Enumeration

We propose a quantifier elimination scheme based on nested lazy model enumeration through SMT-solving, and projections. This scheme may be applied to any logic that fulfills certain conditions; we illustrate it for linear real arithmetic. The quantifier elimination problem for linear real arithmetic is doubly exponential in the worst case, and so is our method. We have implemented it and benchm...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Information and Computation

سال: 2001

ISSN: 0890-5401

DOI: 10.1006/inco.2001.2910